A Self-Adaptive Multiobjective Differential Evolution Algorithm for the Unrelated Parallel Batch Processing Machine Scheduling Problem

نویسندگان

چکیده

In this paper, the unrelated parallel batch processing machine (UPBPM) scheduling problem is addressed to minimize total energy consumption (TEC) and makespan. Firstly, a mixed-integer line programming model (MILP) of UPBPM presented. Secondly, self-adaptive multiobjective differential evolution (AMODE) algorithm put forward. Since parameter value can affect performance greatly, an adaptive control method proposed according convergence index individual degree population improve exploitation exploration ability algorithm. Meanwhile, mutation strategy algorithm’s solutions’ diversity. Finally, verify effectiveness algorithm, comparative experiments are carried out on 20 instances with 5 different scales. Numerical comparisons indicate that achieve high comprehensive performance.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness

This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...

متن کامل

A bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics

This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...

متن کامل

A Quantum Immune Algorithm for Multiobjective Parallel Machine Scheduling

The study presents a novel quantum immune algorithm (QIA) for solving the parallel machine scheduling in the textile manufacturing industry. In this proposed algorithm, there are distinct characteristics as follows. First, the encoding method is based on Q-bit representation. Second, a novel mutation operator with a chaos-based rotation gate is proposed. Most importantly, two diversity schemes,...

متن کامل

A Hybrid Algorithm for Solving the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Times

This work addresses the unrelated parallel machine scheduling problem where setup times are sequence-dependent and machine-dependent. The maximum completion time of the schedule, known as makespan, is considered as an objective to minimize. Few studies has been done about this problem, which is a motivation to the development of this work. Other motivations are the fact that it is NP-Hard and i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Problems in Engineering

سال: 2022

ISSN: ['1026-7077', '1563-5147', '1024-123X']

DOI: https://doi.org/10.1155/2022/5056356